Comparing classification tree structures: A special case of comparing q-ary relations II

نویسندگان

  • Israël-César Lerman
  • F. Rouxel
چکیده

Comparing q-ary relations on a set O of elementary objects is one of the most fundamental problems of classiication and combinatorial data analysis. In this paper the speciic comparison task that involves classiication tree structures (binary or not) is considered in this context. Two mathematical representations are proposed. One is deened in terms of a weighted binary relation; the second uses a four-ary relation. The most classical approaches to tree comparison, are discussed in the context of a set theoretic representation of these relations. Formal and combinatorial computing aspects of a construction method for a very general family of association coeecients between relations are presented. The main purpose of this article is to specify the components of this construction, based on a permutational procedure, when the structures to be compared are classiication trees. Comparaison d'arbres de classiication : un cas sp eciique de la comparaison de relations q-aires R esum e : La comparaison des relations q-aires sur un ensemble O d'objets el ementaires, est l'un des probl emes les plus fondamentaux de la Classiication et Analyse Combinatoire des Donn ees. La comparaison des structures d'arbres de classiication (binaires ou non) est etudi ee dans ce contexte en tenant compte de la sp eciicit e de ces structures. Deux repr esen-tations math ematiques sont propos ees. La premi ere correspond a une relation binaire valu ee; et la seconde, a une relation 4-aire. Dans ces conditions, les approches les plus classiques de comparaison d'arbres, sont situ ees relativement a une repr esentation ensembliste de ces relations. Nous pr esentons les aspects du calcul formel et combinatoire, d'une m ethode de construction, d'une famille tr es g en erale de coeecients d'association entre relations. L'objet principal de cet article consiste a sp eciier les composandes de cette construction fond ee sur un mod ele permutationnel, quand les structures a comparer sont des arbres de classiication.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A k-Structure Generalization of the Theory of 2-Structures

Ehrenfeucht. A. and R. McConnell, A k-structure generalization of the theory of 2-structures, Theoretical Computer Science 132 (1994) 209-227. The prime tree decomposition of graphs facilitates the solution of a number of important combinatorial problems. The decomposition is also known as modular decomposition and substitution decomposition. It has been generalized to 2-structures and to k-ary...

متن کامل

Comparing different stopping criteria for fuzzy decision tree induction through IDFID3

Fuzzy Decision Tree (FDT) classifiers combine decision trees with approximate reasoning offered by fuzzy representation to deal with language and measurement uncertainties. When a FDT induction algorithm utilizes stopping criteria for early stopping of the tree's growth, threshold values of stopping criteria will control the number of nodes. Finding a proper threshold value for a stopping crite...

متن کامل

Comparing the Results of Logistic Regression Model and Classification and Regression Tree Analysis in Determining Prognostic Factors for Coronary Artery Disease in Mashhad, Iran

Background and purpose: Understanding of the risk factors for cardiovascular artery disease, which is the leading cause of death worldwide, can lead to essential changes in its etiology, prevalence, and treatment. The aim of this study was to compare the results of logistic regression model and Classification and Regression Tree Analysis (CART) in determining the prognostic factors for coronary...

متن کامل

Efficient Enumeration for Conjunctive Queries over X-underbar Structures

We investigate efficient enumeration algorithms for conjunctive queries for databases over binary relations that satisfy the X property. Tree-like relations such as XPath axes or grids are natural examples of such relations. We first show that the result of an n-ary conjunctive query Q over an X structure S can be enumerated with a delay in O(n·|S|·|Q|) between two consecutive n-tuples. Then, w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • RAIRO - Operations Research

دوره 34  شماره 

صفحات  -

تاریخ انتشار 1999